Generalized Multi-Constrained Path (G_MCP) QoS Routing Algorithm for Mobile Ad hoc Networks

In mobile ad hoc network, efficient routing protocol is required to perform route discovery and maintenance. These protocols can be classified into two main types which are proactive and reactive routing protocols. Most of them usually use the suboptimal path to reach destination without considering QoS parameters. This results in network congestion during high traffic load situation. Hence, many algorithms have been proposed to offer QoS routing to these protocols. However, most of them find the feasible path by using only one or two QoS metrics. This is not enough to support many applications with QoS guaranteed, especially multimedia applications since they have more stringent various QoS requirements. To provide QoS routing in ad hoc network based on such environment, we propose the effective algorithm called Generalized MCP (G MCP) to find the feasible path based on proposed weighted Connectivity Index (combination of link connectivity and capacity) and nonlinear cost (combination of multiple additive QoS metrics using non-linear function). We adopt the fall-back approach. That is, G MCP will find the path from source to destination by considering weighted Connectivity Index first. If there is a tie, the path with least non-linear cost will be chosen. Based on this approach, G MCP has the comparable time complexity with the Shortest-Widest Path algorithm. We construct the simulation in a number of scenarios based on proactive protocol called OLSR. According to the simulation results, it is obvious that G MCP performances are superior than OLSR and Shortest-Widest Path algorithms in terms of throughput, packet delivery ratio, delay and success ratio. Therefore, it can be concluded that G MCP is able to support various applications and be operated well in highly dynamic mobility environment.